github.com/andybalholm/brotli/matchfinder.ZDFast.current (field)

20 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		zdfast.go#L20: 	current   int32
		zdfast.go#L26: 	z.current = 0
		zdfast.go#L38: 	if int(z.current) >= int(math.MaxInt32)-2*z.MaxDistance-len(z.history) {
		zdfast.go#L39: 		minOffset := z.current + int32(len(z.history)) - int32(z.MaxDistance)
		zdfast.go#L45: 				v = v - z.current + int32(z.MaxDistance)
		zdfast.go#L54: 				v = v - z.current + int32(z.MaxDistance)
		zdfast.go#L58: 		z.current = int32(z.MaxDistance)
		zdfast.go#L70: 			z.current += int32(offset)
		zdfast.go#L106: 			entry := tableEntry{offset: s + z.current, val: uint32(cv)}
		zdfast.go#L133: 			coffsetL := s - (candidateL.offset - z.current)
		zdfast.go#L134: 			coffsetS := s - (candidateS.offset - z.current)
		zdfast.go#L136: 				t = candidateL.offset - z.current
		zdfast.go#L143: 				t = candidateS.offset - z.current
		zdfast.go#L152: 				coffsetL = s - (candidateL.offset - z.current) + 1
		zdfast.go#L153: 				z.longTable[nextHashL] = tableEntry{offset: s + 1 + z.current, val: uint32(cv)}
		zdfast.go#L155: 					t = candidateL.offset - z.current
		zdfast.go#L164: 				t = candidateS.offset - z.current
		zdfast.go#L204: 		te0 := tableEntry{offset: index0 + z.current, val: uint32(cv0)}
		zdfast.go#L205: 		te1 := tableEntry{offset: index1 + z.current, val: uint32(cv1)}
		zdfast.go#L226: 			entry := tableEntry{offset: s + z.current, val: uint32(cv)}